Complexity classes - PDFSEARCH.IO - Document Search Engine

Complexity classes
Results: 1120

#	Item
111	Measure on Small Complexity Classes, with Applications for BPP Eric Allender Department of Computer Science Rutgers University New Brunswick, NJ 08903 Add to Reading List Source URL: ftp.cs.rutgers.edu Language: English - Date: 2001-06-15 14:23:16
112	February 3, 2009 COM S 6810 Theory of Computing Lecture 5: Polynomial Hierarchy Instructor: Rafael Pass Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2009-02-04 17:20:26 Computational complexity theory Complexity classes Theory of computation Polynomial hierarchy P versus NP problem IP True quantified Boolean formula NP PP Oracle machine PSPACE-complete Polynomial-time reduction
113	Computation Power of Randomization and Nondeterminism 2 Scientific Work Add to Reading List Source URL: www.ite.ethz.ch Language: English - Date: 2008-10-23 07:54:38 Complexity classes Computational complexity theory Finite automata Models of computation Analysis of algorithms Nondeterminism NL Randomized algorithm Automata theory Theory of computation Communication complexity NP
114	CAPTCHA: Using Hard AI Problems For Security Luis von Ahn1 , Manuel Blum1 , Nicholas J. Hopper1 , and John Langford2 1 Computer Science Dept., Carnegie Mellon University, Pittsburgh PA 15213, USA Add to Reading List Source URL: hunch.net Language: English - Date: 2003-09-18 19:47:10 Computational neuroscience Human-based computation Complexity classes CAPTCHA Computer security Computer vision Internet bot Turing test Artificial general intelligence Luis von Ahn Artificial intelligence NP
115	On Symmetric Circuits and FPC Anuj Dawar University of Cambridge Computer Laboratory joint work with Matthew Anderson Add to Reading List Source URL: highlights-conference.org Language: English - Date: 2013-09-18 06:35:59 Complexity classes Theory of computation Theoretical computer science Circuit complexity Computational complexity theory Computer science Boolean circuit Logic in computer science NC P Circuit FO
116	Safe Nondeterminism in a Deterministic-by-Default Parallel Language Robert L. Bocchino Jr.1 Stephen Heumann2 Nima Honarmand2 Sarita V. Adve2 Add to Reading List Source URL: www.adamwelc.org Language: English - Date: 2011-01-04 17:23:47 Software engineering Computing Computer programming Concurrency control Transaction processing Complexity classes Java Functional languages Deterministic Parallel Java Determinism Deterministic algorithm Linearizability
117	RevCalcDisc_MGnewuch_et_al.dvi Add to Reading List Source URL: www.numerik.uni-kiel.de Language: English - Date: 2008-10-15 10:46:12 Complexity classes Circuit complexity NC NP Gap reduction MAX-3SAT
118	SIAM J. COMPUT. Vol. 43, No. 1, pp. 312–336 c 2014 Society for Industrial and Applied Mathematics Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-02-27 01:13:13 Computational complexity theory Operations research Complexity classes Polynomial-time approximation scheme Mechanism design Optimization problem Approximation algorithm Time complexity Mathematical optimization Exact algorithm Single-parameter utility Perturbation theory
119	PDF Document Add to Reading List Source URL: highlights-conference.org Language: English - Date: 2013-09-19 17:14:58 Algebra Mathematics Complexity classes Vectors Theory of computation Diagrams Petri net Reachability P FO Vector space Euclidean vector
120	PDF Document Add to Reading List Source URL: www.math.stevens.edu Language: English - Date: 2008-11-13 14:12:11 Theory of computation Computational complexity theory Theoretical computer science Computability theory Analysis of algorithms Complexity classes Generic-case complexity Halting problem Time complexity Algorithm NP Randomized algorithm

UPDATE